On the Instructions of SCMFSA
نویسنده
چکیده
The articles [20], [19], [29], [3], [16], [21], [15], [30], [7], [8], [2], [22], [27], [1], [9], [5], [10], [11], [17], [4], [6], [28], [13], [14], [23], [25], [24], [18], [26], and [12] provide the notation and terminology for this paper. For simplicity, we adopt the following convention: a, b denote integer locations, f denotes a finite sequence location, i1, i2, i3 denote instruction-locations of SCMFSA, T denotes an instruction type of SCMFSA, and k denotes a natural number. The following two propositions are true:
منابع مشابه
A Small Computer Model with Push-Down Stack1
The SCMFSA computer can prove the correctness of many algorithms. Unfortunately, it cannot prove the correctness of recursive algorithms. For this reason, this article improves the SCMFSA computer and presents a Small Computer Model with PushDown Stack (called SCMPDS for short). In addition to conventional arithmetic and ”goto” instructions, we increase two new instructions such as ”return” and...
متن کاملA Small Computer Model with Push-Down Stack
The SCMFSA computer can prove the correctness of many algorithms. Unfortunately, it cannot prove the correctness of recursive algorithms. For this reason, this article improves the SCMFSA computer and presents a Small Computer Model with Push-Down Stack (called SCMPDS for short). In addition to conventional arithmetic and ”goto” instructions, we increase two new instructions such as ”return” an...
متن کاملInitialization Halting Concepts and Their Basic Properties of SCMFSA
Up to now, many properties of macro instructions of SCMFSA are described by the parahalting concepts. However, many practical programs are not always halting while they are halting for initialization states. For this reason, we propose initialization halting concepts. That a program is initialization halting (called ”InitHalting” for short) means it is halting for initialization states.In order...
متن کاملOn the Instructions of SCM FSA 1 Artur
The articles [18], [10], [11], [12], [22], [5], [14], [3], [6], [20], [7], [8], [9], [4], [19], [1], [2], [23], [24], [17], [16], [13], [21], and [15] provide the terminology and notation for this paper. For simplicity, we use the following convention: a, b are integer locations, f is a finite sequence location, i1, i2, i3 are instruction-locations of SCMFSA, T is an instruction type of SCMFSA,...
متن کاملComputation and Program Shift in the SCMPDS Computer
A finite partial state is said to be autonomic if the computation results in any two states containing it are same on its domain. On the basis of this definition, this article presents some computation results about autonomic finite partial states of the SCMPDS computer. Because the instructions of the SCMPDS computer are more complicated than those of the SCMFSA computer, the results given by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004